Tractable Meta-Reasoning in Propositional Logics of Belief

نویسنده

  • Gerhard Lakemeyer
چکیده

Finding adequate semantic models of deductive reasoning is a difficult problem, if deductions are to be performed efficiently and in a semantically appropriate way. The model of reasoning provided by possible-worlds semantics has been found deficient both for computational and intuitive reasons. Existing semantic approaches that were proposed as alternatives to possible-worlds semantics either suffer from computational intractability or do not allow agents to have meta-beliefs. This work, based on relevance logic, proposes a model of belief where an agent can hold met a-beliefs and reason about them and other world knowledge efficiently. It is also shown how the model can be extended to include positive introspection without losing efficiency.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Reasoning System for a First-Order Logic of Limited Belief

Logics of limited belief aim at enabling computationally feasible reasoning in highly expressive representation languages. These languages are often dialects of first-order logic with a weaker form of logical entailment that keeps reasoning decidable or even tractable. While a number of such logics have been proposed in the past, they tend to remain for theoretical analysis only and their pract...

متن کامل

Algorithm for Adapting Cases Represented in a Tractable Description Logic

Case-based reasoning (CBR) based on description logics (DLs) has gained a lot of attention lately. Adaptation is a basic task in CBR that can be modeled as a knowledge base revision problem which has been solved in propositional logic. However, in DLs, adaptation is still a challenge problem since existing revision operators only work well for DLs of the DL-Lite family. It is difficult to desig...

متن کامل

Cant Ext Ual Easoning Is N

The logic of context with the ist (c,p) modality has been proposed by McCarthy as a foundation for contextual reasoning. This paper shows that propositional logic of context is NP-complete and therefore more tractable than multimodal logics or Multi Language hierarchical logics which are PSPACE-complete, This result is given in a proof-theoretical way by providing a tableau calculus, which can ...

متن کامل

Tractable Temporal Reasoning

Temporal reasoning is widely used within both Computer Science and Artificial Intelligence. The basic idea of proof, within propositional, discrete temporal logics, is both intuitive and appealing. However, the underlying complexity of such discrete temporal logics has led to use of either simplified formalisms, such as temporal interval algebras, or simplified techniques, such as model checkin...

متن کامل

Bayesian Description Logics

We present Bayesian Description Logics (BDLs): an extension of Description Logics (DLs) with contextual probabilities encoded in a Bayesian network (BN). Classical DL reasoning tasks are extended to consider also the contextual and probabilistic information in BDLs. A complexity analysis of these problems shows that, for propositionally closed DLs, this extension comes without cost, while for t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987